Ascending Price Vickrey Auctions Using Primal-Dual Algorithms∗

نویسندگان

  • Debasis Mishra
  • David C. Parkes
چکیده

The direct Vickrey-Clarke-Groves (VCG) mechanism requires solving underlying optimization problems of the main economy and of every “marginal” economy. We show that VCG outcome can be implemented using a competitive equilibrium (CE) of the main economy if and only if that CE price is also a CE price of every marginal economy. We call such a CE price a universal competitive equilibrium (UCE) price. We design an ascending price auction that implements the VCG outcome under any valuation profile of buyers using this UCE price concept. The auction searches for a UCE price, and calculates payments of buyers from the final UCE price and allocation. This approach is particularly useful in settings where a CE price supporting VCG payments may be absent (for example, when substitutes condition on valuations does not hold) and answers the question whether VCG outcome can be implemented using iterative ascending price auctions for generic valuation profiles. We relate our work to the recent work of de Vries et al. [13] and show that when buyers are substitutes, their auction converges to a UCE price. When buyers are not substitutes, their auction gives a starting price for our auction.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ascending Auctions and Linear Programming∗

Based on the relationship between dual variables and sealed-bid Vickrey auction payments (established by Bikhchandani and Ostroy), we consider simpler, specific formulations for various environments. For some of those formulations, we interpret primal-dual algorithms as ascending auctions implementing the Vickrey payments. We focus on three classic optimization problems: assignment, matroid, an...

متن کامل

Linear Programming and Vickrey Auctions

The Vickrey sealed bid auction occupies a central place in auction theory because of its efficiency and incentive properties. Implementing the auction requires the auctioneer to solve n + 1 optimization problems, where n is the number of bidders. In this paper we survey various environments (some old and some new) where the payments bidders make under the Vickrey auction correspond to dual vari...

متن کامل

Ascending price Vickrey auctions for general valuations

Ascending price auctions typically involve a single price path with buyers paying their final bid price. Using this traditional definition, no ascending price auction can achieve the Vickrey-Clarke-Groves (VCG) outcome for general private valuations in the combinatorial auction setting. We relax this definition by allowing discounts to buyers from the final price of the auction (or alternativel...

متن کامل

An Experimental Comparison of Linear and Nonlinear Price Combinatorial Auctions

Combinatorial auctions are used for the efficient allocation of heterogeneous goods and services. They require appropriate software platforms providing automated winner determination and decision support for bidders. Several promising ascending combinatorial auction formats have been developed throughout the past few years based on primal-dual algorithms and linear programming theory. The Ascen...

متن کامل

The Vickrey-Target Strategy and the Core in Ascending Combinatorial Auctions

This paper considers a general class of combinatorial auctions with ascending prices, which includes the Vickrey-Clarke-Groves mechanism and core-selecting auctions. We analyze incentives in ascending combinatorial auctions under complete and perfect information. We show that in every ascending auction, the “Vickrey-target strategy” constitutes a subgame perfect equilibrium with a restricted st...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004